The Ramsey Test and the Indexicality of Conditionals: A Proposed Resolution of Gärdenfors' Paradox

نویسنده

  • Sten Lindström
چکیده

Working within the AGM approach, Peter Gärdenfors has proved that — given certain auxiliary assumptions — there are no non-trivial belief revision systems that satisfy both the Ramsey test and the Preservation condition. There are various ways of reacting to Gärdenfors' paradoxical result. Gärdenfors himself has described his result as a dilemma: we must give up either the Ramsey test or the Preservation condition. Isaac Levi has pointed to an implicit assumption in Gärdenfors' approach: conditionals express truth-value bearing propositions and are therefore eligible as members of belief sets. Here, we shall focus on another implicit assumption: a conditional sentence A > B expresses one and the same proposition relative to every belief state. We shall argue that contrary to the this assumption, epistemic conditionals are naturally interpreted as context-sensitive: an epistemic conditional expresses a proposition, but only relative to a belief state. According to the approach advocated here, a sharp distinction is made between the semantic level containing propositions and belief states and the linguistic level containing sentences and sets of sentences. Belief revision is viewed as an operation on belief states; and it is primarily propositions rather than sentences that are accepted relative to belief states. At the semantic level, Gärdenfors' result applies to the Ramsey test in the form: (P-R) The proposition P ⇒ Q is accepted in the belief state S iff Q is accepted in the state S∗P which is the result of revising S with the proposition P. Thinking of the connective > as corresponding to a binary operation ⇒ on propositions is, however, tantamount to assuming that epistemic conditionals are context-independent. Once, we give up this assumption, we see that the proper way of formulating the Ramsey test for propositions is not (P-R) but rather: (P-Ramsey) P ⇒S Q is accepted in the belief state S iff Q is accepted in S∗P. But, as we shall see, (P-Ramsey) is compatible with Gärdenfors' postulates for belief revision. We also show how to accommodate the full Ramsey test for conditional sentences, thus allowing for unlimited iteration of conditionals. Our conclusion is that there is no real conflict between Preservation and the Ramsey test — once we take the context dependency of epistemic conditionals into account.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Ramsey Test without Triviality

We present a way of classifying the logically possible ways out of Gärdenfors’ inconsistency or triviality result on belief revision with conditionals. For one of these ways—conditionals which are not descriptive but which only have an inferential role as being given by the Ramsey test—we determine which of the assumptions in three different versions of Gärdenfors’ theorem turn out to be false....

متن کامل

Belief-Revision, the Ramsey Test, monotonicity, and the so-Called Impossibility Results

Peter Gärdenfors proved a theorem purporting to show that it is impossible to adjoin to the AGM-postulates for belief-revision a principle of monotonicity for revisions. The principle of monotonicity in question is implied by the Ramsey test for conditionals. So Gärdenfors’ result has been interpreted as demonstrating that it is impossible to combine the Ramsey test for conditionals with the ba...

متن کامل

New surprises for the Ramsey Test

In contemporary discussions of the Ramsey Test for conditionals, it is commonly held that (i) supposing the antecedent of a conditional is adopting a potential state of full belief, and (ii) Modus Ponens is a valid rule of inference. I argue on the basis of Thomason Conditionals (such as ‘If Sally is deceiving, I do not believe it’) and Moore’s Paradox that both claims are wrong. I then develop...

متن کامل

A nonmonotonic conditional logic for belief revision. Part 1: Semantics and logic of simple conditionals

Using Gärdenfors’s notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. It explains why we may generally infer If ¬A then B if all we know is A∨B while must not generally infer If ¬A then B if all we know is {A∨B,A}. More generally, it explains the nonmonotonic nature of the consequence relation governing languages which contain conditio...

متن کامل

Reapproaching Ramsey: Conditionals and Iterated Belief Change in the Spirit of AGM

According to the Ramsey Test, conditionals reflect changes of beliefs: α > β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996